unit disk graph造句
例句與造句
- The problem admits a PTAS for special cases such as unit disk graphs and planar graphs.
- In bandwidth allocation to radio stations, the resulting conflict graph is a unit disk graph, so the coloring problem is 3-approximable.
- In geometric graph theory, a "'unit disk graph "'is the intersection graph of a family of unit disks in the Euclidean plane.
- For instance, the intersection graph of line segments in one dimension is an interval graph; the intersection graph of unit disks in the plane is a unit disk graph.
- It is NP-hard ( more specifically, complete for the existential theory of the reals ) to determine whether a graph, given without geometry, can be represented as a unit disk graph.
- It's difficult to find unit disk graph in a sentence. 用unit disk graph造句挺難的
- Additionally, it is provably impossible in polynomial time to output explicit coordinates of a unit disk graph representation : there exist unit disk graphs that require exponentially many bits of precision in any such representation.
- Additionally, it is provably impossible in polynomial time to output explicit coordinates of a unit disk graph representation : there exist unit disk graphs that require exponentially many bits of precision in any such representation.
- Similarly, in a unit disk graph ( with a known geometric representation ), there is a polynomial time algorithm for maximum cliques based on applying the algorithm for complements of bipartite graphs to shared neighborhoods of pairs of vertices.
- Even if a disk representation is not known, and an abstract graph is given as input, it is possible in polynomial time to produce either a maximum clique or a proof that the graph is not a unit disk graph.
- Subsequent developments have shown that every network has a greedy embedding with succinct vertex coordinates in the hyperbolic plane, that certain graphs including the polyhedral graphs have greedy embeddings in the Euclidean plane, and that unit disk graphs have greedy embeddings in Euclidean spaces of moderate dimensions with low stretch factors.
- By applying Menger's theorem to the unit disk graph defined from the barriers, this minimal number of disks can be shown to equal the maximum number of subsets into which all of the disks can be partitioned, such that each subset contains a chain of disks passing all the way from the left to the right side of the rectangle.
- The Vietoris Rips complex of a set of points in a metric space is a special case of a clique complex, formed from the unit disk graph of the points; however, every clique complex " X ( G ) " may be interpreted as the Vietoris Rips complex of the shortest path metric on the underlying graph " G ".